package class04;

import java.util.Arrays;

/**
 * @author zhangchaoliang
 * create 2022
 */
public class HeapSort2 {

    public static void heapSort(int[] arr){
        if (arr==null||arr.length<2)
            return;
        for (int i=0;i<arr.length;i++)
            heapInset(arr,i);
        int heapSize = arr.length;
        swap(arr,0,--heapSize);
        while (heapSize>0){
            heapify(arr,0,heapSize);
            swap(arr,0,--heapSize);
        }
    }

    public static void swap(int[] arr,int i,int j){
        int tmp = arr[i];
        arr[i]=arr[j];
        arr[j]=tmp;
    }

    public static void heapInset(int[] arr,int index){
        while (arr[index]>arr[(index-1)/2 ]){
            swap(arr,index,(index-1)/2 );
            index=(index-1)/2;
        }
    }

    public static void heapify(int[] arr,int index ,int heapSize){
        int left = index*2+1;
        while (left<heapSize){
            int largerst = left+1<heapSize&&arr[left+1]>arr[left]?left+1:left;
            largerst=arr[largerst]>arr[index]?largerst:index;
            if (largerst==index)
                break;
            swap(arr,largerst,index);
            index=largerst;
            left=index*2+1;
        }
    }

    public static void comparator(int[] arr){
        Arrays.sort(arr);
    }

    public static int[] generatorRandomArray(int maxSize,int maxValue){
        int[] arr = new int[(int)((maxSize+1)*Math.random())];
        for (int i=0;i<arr.length;i++)
            arr[i]=(int)((maxValue+1)*Math.random())
                    -(int)((maxValue+1)*Math.random());
        return arr;
    }

    public static int[] copyArray(int[] arr){
        if (arr==null)
            return null;
        int[] res = new int[arr.length];
        for (int i=0;i<arr.length;i++)
            res[i]=arr[i];
        return res;
    }

    public static boolean isEqual(int[] arr1,int[] arr2){
        if ((arr1!=null&&arr2==null)||(arr1==null&&arr2!=null))
            return false;
        if (arr1==null&&arr2==null)
            return true;
        if (arr1.length!=arr2.length)
            return false;
        for (int i=0;i<arr1.length;i++){
            if (arr1[i]!=arr2[i])
                return false;
        }
        return true;
    }

    public static void printArray(int[] arr){
        if (arr==null)
            return;
        for (int i=0;i<arr.length;i++)
            System.out.println(arr[i]+" ");
        System.out.println();
    }

    public static void main(String[] args) {
        int testTime = 500000;
        int maxSize = 100;
        int maxValue = 100;
        boolean succeed = true;
        for (int i=0;i<testTime;i++){
            int[] arr1 = generatorRandomArray(maxSize,maxValue);
            int[] arr2 = copyArray(arr1);
            heapSort(arr1);
            comparator(arr2);
            if (!isEqual(arr1,arr2)){
                succeed=false;
                break;
            }
        }
        System.out.println(succeed?"Nice!":"Fuck fucking!");
    }
}
